Parallelization of Radiosity Method Master ' s Thesis

نویسنده

  • Pavol Slamka
چکیده

In this thesis, we focus on design of a highly e cient parallel algorithm for solving the radiosity method. The presented parallel algorithm is based on the progressive radiosity method. We use asynchronous message passing model in combination with communication-thread in order to overlap communication with computation. This approach allows us to take a di erent numerical approach to the problem, thus decreasing the communication between processors. All this improves e ciency of the parallel algorithm. The parallelization at a high level of sequential algorithm further decreases the communication and can be viewed as a parallel framework, which is independent of the implementation of lower layers. In this thesis, we design a fully asynchronous algorithm and an algorithm with deferred synchronization for progressive radiosity solution. For comparison, we also designed a simple synchronous algorithm. Finally we propose two load balancing approaches based on work stealing, which are suitable for presented algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallelization of a Discrete Radiosity Method Using Scene Division

We present in this article a parallelization of a discrete radiosity method, based on scene division and achieved on a cluster of workstations. This method is based on discretization of surfaces into voxels and not into patches like most of the radiosity methods do. Voxels are stocked into visibility lists representing the space partition into discrete lines and allowing mutually visible neighb...

متن کامل

Parallelization of a Discrete Radiosity Method

In this paper we present three different parallelizations of a discrete radiosity method achieved on a cluster of workstations. This radiosity method has lower complexity when compared with most of the radiosity algorithms and is based on the discretization of surfaces into voxels and not into patches. The first two parallelizations distribute the tasks. They present good performance in time bu...

متن کامل

Scalability and Granularity Issues of the Hierarchical Radiosity Method

The radiosity method is a global illumination method from computer graphics to visualize light in scenes of diiuse objects within an enclosure. The hierarchical radiosity method reduces the problem size considerably but results in a highly irregular algorithm which makes a parallel implementation more diicult. We investigate a task-oriented shared memory implementation and present optimizations...

متن کامل

A parallel progressive radiosity algorithm based on patch data circulation

--Current research on radiosity has concentrated on increasing the accuracy and the speed of the solution. Although algorithmic and meshing techniques decrea,se the execution time, still excessive computational power is required for complex scenes. Hence, parallelism can be exploited for speeding up the method further. This paper aims at providing a thorough examination of parallelism in the ba...

متن کامل

Solving Irregular Problems through Parallel Irregular Trees

This paper presents PIT, a library for the parallelization of irregular problems on distributed memory architectures. All the strategies underlying the definition of the library can be expressed in terms of operations on a PITree, a parallel version of the tree data structure oriented to irregular problems. We consider the application of PIT to two well known irregular problems: adaptive multig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007